A METHOD TO HANDLE BCH(n,k,t) ALGORITHM OVER LARGE GF(n) IN PRACTICAL HARDWARE IMPLEMENTATIONS
نویسندگان
چکیده
This paper presents an approach to handle with elements from GF(2), in hardware implementation with minimum costs of area. The method is described by exemplifying with minimum costs of area. The method is described by exemplifying the practical implementation of the BCH(n,k,t) scheme over GF(2), where n is large (n > 6), on reconfigurable FPGA hardware with minimum costs of area. There are many papers in the open literature which presents hardware implementations of algorithms over GF(2) but none of them addresses the problem of hardware resources employed. There are many situations in which an area optimized implementation is more suitable than a speed optimized implementation.
منابع مشابه
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملNew multilevel codes over GF(q)
In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...
متن کاملOverlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms for Hardware Implementations
We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[x] Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33% and 25% for n = 2 and n = 3 (t > 1), respectively. To the best of our knowledge, this parameter has never been improved since ...
متن کاملLee-metric BCH codes and their application to constrained and partial-response channels
We show that each code in a certain class of BCH codes over GF (p), specified by a code length n ≤ p−1 and a runlength r ≤ (p−1)/2 of consecutive roots in GF (p), has minimum Lee distance ≥ 2r. For the very high-rate range these codes approach the sphere-packing bound on the minimum Lee distance. Furthermore, for a given r, the length range of these codes is twice as large as that attainable by...
متن کامل